2018-00455 - Post-Doctoral - Rewriting theory for rings of functional operators
ثبت نشده
چکیده
The Inria Lille Nord Europe Research Centre was founded in 2008 and employs a staff of 360, including 300 scientists working in sixteen research teams. Recognised for its outstanding contribution the socio-economic development of the Nord Pas-de-Calais Region, the Inria Lille Nord Europe Research Centre undertakes research in the field of computer science in collaboration with a range of academic, institutional and industrial partners.
منابع مشابه
A Critical Review of Kohlberg’s Theory of Moral Judgment and a Guideline on its Developmental Stages
A Critical Review of Kohlberg’s Theory of Moral Judgment and a Guideline on its Developmental Stages A.R. Assaareh, Ph.D. * A. Mahdizaadeh Tehraani** A.R. Amini Zarrin*** S. Azimi**** Developmental theories describe and explain stages in which different aspects of human psyche develop. Among such theories is Kohlberg’s theory of moral judgment wherein a complex ...
متن کاملSome generalizations of Darbo's theorem for solving a systems of functional-integral equations via measure of noncompactness
In this paper, using the concept of measure of noncompactness, which is a very useful and powerful tools in nonlinear functional analysis, metric fixed point theory and integral equations, we introduce a new contraction on a Banach space. For this purpose by using of a measure of noncompactness on a finite product space, we obtain some generalizations of Darbo’s fixed-point theorem. Then, with ...
متن کاملCoinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define ∞ =, the infinitary extension of a given equational theory =R, and →∞, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: ∞ = := νR. (=R ∪ R) → := μR. νS. (→R ∪ R) ; S Here μ and ν are the leas...
متن کاملDefinability of linear equation systems over groups and rings
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixedpoint ...
متن کاملReduction operators and completion of rewriting systems
Article history: Received 3 June 2016 Accepted 12 February 2017 Available online 23 March 2017
متن کامل